Monte Carlo Algorithms for Finding the Maximum of a Random Walk with Negative Drift
نویسندگان
چکیده
We discuss two Monte Carlo algorithms for finding the global maximum of a simple random walk with negative drift. This problem can be used to connect the analysis of random input Monte Carlo algorithms with ideas and principles from mathematical statistics.
منابع مشابه
Evaluating Performance of Algorithms in Lung IMRT: A Comparison of Monte Carlo, Pencil Beam, Superposition, Fast Superposition and Convolution Algorithms
Background: Inclusion of inhomogeneity corrections in intensity modulated small fields always makes conformal irradiation of lung tumor very complicated in accurate dose delivery.Objective: In the present study, the performance of five algorithms via Monte Carlo, Pencil Beam, Convolution, Fast Superposition and Superposition were evaluated in lung cancer Intensity Modulated Radiotherapy plannin...
متن کاملMonte Carlo Comparison of Approximate Tolerance Intervals for the Poisson Distribution
The problem of finding tolerance intervals receives very much attention of researchers and are widely used in various statistical fields, including biometry, economics, reliability analysis and quality control. Tolerance interval is a random interval that covers a specified proportion of the population with a specified confidence level. In this paper, we compare approximate tolerance interva...
متن کاملRandom Walk Algorithms for Estimating Effective Properties of Digitized Porous Media
s — In this paper we describe a Monte Carlo method for permeability calculations in complex digitized porous structures. The relation between the permeability and the diffusion penetration depth is established. The corresponding Dirichlet boundary value problem is solved by random walk algorithms. The results of computational experiments for some random models of porous media confirm the log-no...
متن کاملUnit root testing in integer - valued AR ( 1 ) models * ̈ ̈
We focus on the testing of a unit root in the integer-valued autoregression of order one. Finite sample distributions for a Dickey-Fuller test of a random walk with drift with Poisson distributed and, hence, skewed errors are obtained by Monte Carlo simulation. 2001 Elsevier Science B.V. All rights reserved.
متن کاملVariational Markov chain Monte Carlo for Bayesian smoothing of non-linear diffusions
In this paper we develop set of novel Markov chain Monte Carlo algorithms for Bayesian smoothing of partially observed non-linear diffusion processes. The sampling algorithms developed herein use a deterministic approximation to the posterior distribution over paths as the proposal distribution for a mixture of an independence and a random walk sampler. The approximating distribution is sampled...
متن کامل